Search results for "local search"

2021

Classification approaches that allow to extract logical rules such as decision trees are often considered to be more interpretable than neural networks. Also, logical rules are comparatively easy to verify with any possible input. This is an important part in systems that aim to ensure correct operation of a given model. However, for high-dimensional input data such as images, the individual symbols, i.e. pixels, are not easily interpretable. Therefore, rule-based approaches are not typically used for this kind of high-dimensional data. We introduce the concept of first-order convolutional rules, which are logical rules that can be extracted using a convolutional neural network (CNN), and w…

Heuristics for the capacitated modular hub location problem

2017

Abstract In this paper we study the hub location problem, where the goal is to identify an optimal subset of facilities (hubs) to minimize the transportation cost while satisfying certain capacity constraints. In particular, we target the single assignment version, in which each node in the transportation network is assigned to only one hub to route its traffic. We consider here a realistic variant introduced previously, in which the capacity of edges between hubs is increased in a modular way. This reflects the practical situation in air traffic where the number of flights between two locations implies a capacity in terms of number of passengers. Then, the capacity can be increased in a mo…

The berth allocation problem in terminals with irregular layouts

2019

As international trade thrives, terminals attempt to obtain higher revenue while coping with an increased complexity with regard to terminal management operations. One of the most prevalent problems such terminals face is the Berth Allocation Problem (BAP), which concerns allocating vessels to a set of berths and time slots while simultaneously minimizing objectives such as total stay time or total assignment cost. Complex layouts of real terminals introduce spatial constraints which limit the mooring and departure of vessels. Although significant research has been conducted regarding the BAP, these real-world restrictions have not been taken into account in a general way. The present work …

Adaptive memory programing for the robust capacitated international sourcing problem

2008

The International Sourcing Problem consists of selecting a subset from an available set of potential suppliers internationally located. The selected suppliers must meet the demand for items from a set of plants, which are also located worldwide. Since the costs are affected by macroeconomic conditions in the countries where the supplier and the plant are located, the formulation considers the uncertainty associated with changes in these conditions. We formulate the robust capacitated international sourcing problem by means of a scenario-optimization approach. When dealing with uncertainty, one of the most common approaches in the literature is to formulate the problem via a set of possible …

Improving Interpolants for Linear Arithmetic

2015

Craig interpolation for satisfiability modulo theory formulas have come more into focus for applications of formal verification. In this paper we, introduce a method to reduce the size of linear constraints used in the description of already computed interpolant in the theory of linear arithmetic with respect to the number of linear constraints. We successfully improve interpolants by combining satisfiability modulo theory and linear programming in a local search heuristic. Our experimental results suggest a lower running time and a larger reduction compared to other methods from the literature.

GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem

2017

In this work, we tackle multidimensional two-way number partitioning (MDTWNP) problem by combining GRASP with Exterior Path Relinking. In the last few years, the combination of GRASP with path relinking (PR) has emerged as a highly effective tool for finding high-quality solutions for several difficult problems in reasonable computational time. However, in most of the cases, this hybridisation is limited to the variant known as interior PR. Here, we couple GRASP with the "exterior form" of path relinking and perform extensive experimentation to evaluate this variant. In addition, we enhance our GRASP with PR method with a novel local search method specially designed for the MDTWNP problem. …

A Memetic-Neural Approach to Discover Resources in P2P Networks

2008

This chapter proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA) for performing in training of the neural network. The neural network, which is a multi-layer perceptron neural network, allows the P2P nodes to efficiently locate resources desired by the user. The necessity of testing the network in various working conditions, aiming to obtain a robust neural network, introduces noise in the objective function. The AGLMA is a memetic algorithm which employs two local search algorithms adaptively activated by an evolutionary framework. These local searchers, having different fe…

A complementary mobile phase approach based on the peak count concept oriented to the full resolution of complex mixtures

2011

Situations of minimal resolution are often found in liquid chromatography, when samples that contain a large number of compounds, or highly similar in terms of structure and/or polarity, are analysed. This makes full resolution with a single separation condition (e.g., mobile phase, gradient or column) unfeasible. In this work, the optimisation of the resolution of such samples in reversed-phase liquid chromatography is approached using two or more isocratic mobile phases with a complementary resolution behaviour (complementary mobile phases, CMPs). Each mobile phase is dedicated to the separation of a group of compounds. The CMPs are selected in such a way that, when the separation is cons…

Peak deconvolution in one-dimensional chromatography using a two-way data approach.

2002

A deconvolution methodology for overlapped chromatographic signals is proposed. Several single-wavelength chromatograms of binary mixtures, obtained in different runs at diverse concentration ratios of the individual components, were simultaneously processed (multi-batch approach), after being arranged as two-way data. The chromatograms were modelled as linear combinations of forced peak profiles according to a polynomially modified Gaussian equation. The fitting was performed with a previously reported hybrid genetic algorithm with local search, leaving all model parameters free. The approach yielded more accurate solutions than those found when each experimental chromatogram was fitted in…

Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation

2022

Abstract Previous analysis suggested the opportunity to consider the preferences of different stakeholders (hospital, patients, doctors and nurses) through the adoption of both patient priority maximisation and workload balance as performance criteria. The aim of this paper is to develop an effective and efficient solution approach for the operating room planning and scheduling capable to take into account the patient priority maximisation and workload balance criteria at the same time. This work is inspired by the need of a deeper understanding of the quality of the solutions obtained when a combination of the two criteria leads the OR planning decisions. Starting from a hierarchical multi…